LeetCode - 121. Best Time to Buy and Sell Stock

문제 링크

problem

Java 풀이

import java.util.*;

class Solution {
    
    public int maxProfit(int[] prices) {
        int answer = 0;
        int buy = Integer.MAX_VALUE;
        
        for(int i = 0; i < prices.length; i++){
            if(prices[i] < buy){
                buy = prices[i];
            }else{                
                answer = Math.max(answer, prices[i] - buy);
            }            
        }
        return answer;
    }
}

Javascript 풀이

var maxProfit = function(prices) {
    let buy = 10000;
    let answer = 0;
    
    for(let i = 0; i < prices.length; i++){
        if(prices[i] < buy){
            buy = prices[i];
        }else{
            answer = Math.max(answer, prices[i] - buy);
        }
    }
    return answer;
};